Precise and scalable points-to analysis via data-driven context tunneling
نویسندگان
چکیده
منابع مشابه
Scalable, Precise Context-Sensitive Top-Down Process for Modular Points-to Analysis
"!# $ % &' ( ) * &" + ," &-," ! " " . / 01 (2" 3 4 " "56 879 " :3 <;+= >?>?=A@*BDC E-E F?=HGJILK?K': M " N " , N 4 M ,( " M % * O " "!M," % % ( P@*=HQ C%RSIP %," 4 " T + . % % U VW 0X Y.01 O " / [Z\ (, ? [ ] 4 M ,( " M ^," ) (5_ ( "," % :\ _>?=AE BDQ =a`3b<E%F?=HGLILK?K':4 4 [ ! c ) / * a 4 U % (!# a " ( d _ ( , 4 [ ," " [ P % ," e 4 / , % (!# < a " ( ) 5 f \ 4 M " < &3 4 M (, ) ( g 01 O [ ", h...
متن کاملCompaction Algorithm for Precise Modular Context-Sensitive Points-to Analysis
Points-to analysis is a critical component of optimization and software engineering tools. A higher degree of precision in this analysis can significantly benefit such tools if it can be provided with a reasonably bounded analysis cost. The focus of this work is to enable a fully context-sensitive modular points-to analysis under the flow-insensitive and inclusionbased intraprocedural setting. ...
متن کاملAnnotations for (more) Precise Points-to Analysis
We extend an existing points-to analysis for Java in two ways. First, we fully support .NET which has structs and parameter passing by reference. Second, we increase the precision for calls to nonanalyzable methods. A method is non-analyzable when its code is not available either because it is abstract (an interface method or an abstract class method), it is virtual and the callee cannot be sta...
متن کاملA Scalable Flow-Sensitive Points-To Analysis
Points-to analysis for large object-oriented systems is currently too imprecise or too slow. This prevents or hampers many useful client analyses, refactorings, or optimizations. In this paper, we present an SSA-based approach to points-to analysis that simulates the actual execution of a program. It is precise since it is both locally and globally flow-sensitive, more precise by construction c...
متن کاملContext-aware recommendations from implicit data via scalable tensor factorization
Albeit the implicit feedback based recommendation problem— when only the user history is available but there are no ratings—is the most typical setting in real-world applications, it is much less researched than the explicit feedback case. State-of-the-art algorithms that are efficient on the explicit case cannot be automatically transformed to the implicit case if scalability should be maintai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2018
ISSN: 2475-1421
DOI: 10.1145/3276510